Minimum circulation of railway stock

نویسنده

  • Alexander Schrijver
چکیده

We describe some research in progress performed for Nederlandse Spoorwegen (Dutch Railways) to determine a minimum circulation of train-units needed to execute a given timetable with given bounds on demands and capacities. 1. The problem Nederlandse Spoorwegen (Dutch Railways) runs an hourly train service on its route Amsterdam-Schiphol Airport-Leyden-The Hague-Rotterdam-Dordrecht-Roosendaal-Middelburg-Vlissingen vice versa, with the following timetable, for each day from Monday till Friday: train number 2123 2127 2131 2135 2139 2143 2147 2151 2155 Amsterdam V 6.48 7.55 8.56 9.56 10.56 11.56 12.56 13.56 Rotterdam A 7.55 8.58 9.58 10.58 11.58 12.58 13.58 14.58 Rotterdam V 7.00 8.01 9.02 10.03 11.02 12.03 13.02 14.02 15.02 Roosendaal A 7.40 8.41 9.41 10.43 11.41 12.41 13.41 14.41 15.41 Roosendaal V 7.43 8.43 9.43 10.45 11.43 12.43 13.43 14.43 15.43 Vlissingen A 8.38 9.38 10.38 11.38 12.38 13.38 14.38 15.38 16.38 train number 2159 2163 2167 2171 2175 2179 2183 2187 2191 Amsterdam V 14.56 15.56 16.56 17.56 18.56 19.56 20.56 21.56 22.56 Rotterdam A 15.58 16.58 17.58 18.58 19.58 20.58 21.58 22.58 23.58 Rotterdam V 16.00 17.01 18.01 19.02 20.02 21.02 22.02 23.02 Roosendaal A 16.43 17.43 18.42 19.41 20.41 21.41 22.41 23.54 Roosendaal V 16.45 17.45 18.44 19.43 20.43 21.43 Vlissingen A 17.40 18.40 19.39 20.38 21.38 22.38 train number 2108 2112 2116 212

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rolling Stock Rostering Optimization Under Maintenance Constraints

This paper presents an integer programming formulation for integrating maintenance planning tasks in the railway rolling stock circulation problem. This is a key problem in railway rostering planning that requires to cover a given set of services and maintenance works with a minimum amount of rolling stock units. An additional objective is to limit the number of empty rides. The constraints of ...

متن کامل

Productivity Management in Iranian Railway by Data Envelopment Analysis

Study of various transportation indicators could be an appropriate criterion in evaluating the performance of the existing railways throughout the globe. This study was carried out to investigate the performance of rolling stock of Iranian railway using productivity analysis. In order to solve the problems, some solutions were provided by productivity management cycle steps. At the first step, ...

متن کامل

A heuristic algorithm for the circulation plan of railway electrical motor units

The rolling stock rostering problem with maintenance constraints is NP-hard. In this paper, a two-stage approach is proposed. Relaxing the maintenance constraints, a transition network with minimum train unit is established in the first stage. A heuristic algorithm based on the transitions interchange is devised to search for a feasible maintenance route. The algorithm is verified with the oper...

متن کامل

Investigation of the Influences of Track Superstructure Parameters on Ballasted Railway Track Design

The main design criteria of ballasted railway tracks include rail deflections, rail bending stresses, rail wheel contact stresses, sleeper bending moments and ballast sleeper contact pressures. Numerous criteria have been defined for the design of ballasted railway tracks owing to the various mechanical properties of track components and their complex interaction. Therefore, railway track desig...

متن کامل

A rolling stock circulation model for combining and splitting of passenger trains

This paper addresses the railway rolling stock circulation problem. Given the departure and arrival times as well as the expected numbers of passengers, we have to assign the rolling stock to the timetable services. We consider several objective criteria that are related to operational costs, service quality and reliability of the railway system. Our model is an extension of an existing rolling...

متن کامل

Railway Delay Management: Exploring Its Algorithmic Complexity

We consider delay management in railway systems. Given delayed trains, we want to find a waiting policy for the connecting trains minimizing the weighted total passenger delay. If there is a single delayed train and passengers transfer at most twice along fixed routes, or if the railway network has a tree structure, the problem can be solved by reduction to min-cut problems. For delayed passeng...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1990